Ju l 2 00 5 The dinner table problem : the rectangular case

نویسنده

  • Roberto Tauraso
چکیده

Assume that 8 people are seated around a table and we want to enumerate the number of ways that they can be permuted such that neighbors are no more neighbors after the rearrangement. Of course the answer depends on the topology of the table: if the table is a circle then it is easy to check by a simple computer program that the permutations that verify this property are 2832, if it is a long bar and all the persons seat along one side then they are 5242. Furthermore, if it is a rectangular table with two sides then the rearrangements are 9512. The first two cases are respectively described by sequences A089222 and A002464 of the On-Line Encyclopedia of Integer Sequences [3], on the other hand the rectangular case does not appear in the literature. Here is a valid rearrangement for n = 8:

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Dinner Table Problem: the Rectangular Case

Consider n people who are seated randomly at a rectangular table with ⌊n/2⌋ and ⌈n/2⌉ seats along the two opposite sides, for two dinners. What is the probability that neighbors at the first dinner are no longer neighbors at the second one? We give an explicit formula and show that its asymptotic behavior as n goes to infinity is e(1+ 4/n) (it is known that it is e(1−4/n) for a round table). A ...

متن کامل

1 5 Ju l 2 00 9 Basis Reduction , and the Complexity of Branch - and - Bound Gábor Pataki and Mustafa Tural

The classical branch-and-bound algorithm for the integer feasibility problem Find x ∈ Q ∩ Zn, with Q = {

متن کامل

Ju l 2 00 4 On Waring ’ s problem for partially symmetric tensors ( variations on a theme of Mella )

Here we address a Waring type problem for partially symmetric tensors, extending previous work by Massimiliano Mella in the totally symmetric case of forms. In particular, we provide an explicit answer in lower dimensional cases. A.M.S. Math. Subject Classification (2000): 14N05.

متن کامل

Configural Processing Consortium ( CPC ) , 2012

WHAT: 9:00-9:15am Arrival & welcome 9:15-10:00 Talk 1 (Steve Palmer) 10:00-10:15 Morning break 10:15-11:45 Session I (Eidels, Viemeister, Ruggles, Schloss, Sarris, Biederman) 11:45-12:30 Lunch break 12:30-1:15 Talk 2 (Jim Townsend) 1:15-2:45 Session II (Peterson, Overliet, Orsten, Little, Kellman, Herzog) 2:45-3:00 Afternoon break 3:00-4:45 Session III (Goldstone, Garrigan, Kimchi, Jiang, Franc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005